منابع مشابه
Dart Throwing on Surfaces
In this paper we present dart throwing algorithms to generate maximal Poisson disk point sets directly on 3D surfaces. We optimize dart throwing by efficiently excluding areas of the domain that are already covered by existing darts. In the case of triangle meshes, our algorithm shows dramatic speed improvement over comparable sampling methods. The simplicity of our basic algorithm naturally ex...
متن کاملAbject pilgrimage and healing in Jaume Roig's Spill.
In the Spill o Llibre de les dones, the 15th century writer and physician from Valencia, Jaume Roig, uses the motif of pilgrimage to attack earthly women, particularly women healers. Roig undermines the salutary function of medieval pilgrimage in order to expose worldly women in their effort to harm male pilgrims. Since men cannot rely on earthly women, they must seek a healing encounter with t...
متن کاملThe abject self: self-states of relentless despair.
Early childhood deprivation, attachment chaos, repeated medical traumata, and abuse set up neural networks of dread, shame, worthlessness, and hopelessness: the phenomenology of abject experience that resides in implicit memory. Abject interactions with others condense yearning and despair into complex enactments of abject suffering. Working in abject subgroups dilutes the intensity of abject m...
متن کاملAlgorithms for localized dart-throwing
How does one “throw localized darts,” that is, place random points in a subregion? It is inefficient just to find points in a larger region, only to check painstakingly every generated point for subregion membership. We describe herein several means for efficient, localized dart-throwing, under the constraint that a subregion’s points be entirely consistent with a restriction of any larger gene...
متن کاملRecognizing Dart - Free Perfect Graphs 1317
A graph G is called a Berge graph if neither G nor its complement contains a chordless cycle whose length is odd and at least five; what we call a dart is the graph with vertices u, v, w, x, y and edges uv, vw, uy, vy, wy, xy; a graph is called dart-free if it has no induced subgraph isomorphic to the dart. We present a polynomial-time algorithm to recognize dart-free Berge graphs; this algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: M/C Journal
سال: 2006
ISSN: 1441-2616
DOI: 10.5204/mcj.2663